Dark Forest Algorithm: A Novel Metaheuristic Algorithm for Global Optimization Problems

نویسندگان

چکیده

Metaheuristic algorithms, as effective methods for solving optimization problems, have recently attracted considerable attention in science and engineering fields. They are popular broad applications owing to their high efficiency low complexity. These algorithms generally based on the behaviors observed nature, physical sciences, or humans. This study proposes a novel metaheuristic algorithm called dark forest (DFA), which can yield improved results global problems. In DFA, population is divided into four groups: highest civilization, advanced normal civilization. Each civilization has unique way of iteration. To verify DFA’s capability, performance DFA 35 well-known benchmark functions compared with that six other including artificial bee colony algorithm, firefly grey wolf optimizer, harmony search grasshopper whale algorithm. The show provides solutions problems dimensions outperforms most when dimensional applied five projects demonstrate its applicability. competitive current algorithms. Finally, potential upgrading routes proposed possible future developments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metaheuristic Optimization: Algorithm Analysis and Open Problems

Metaheuristic algorithms are becoming an important part of modern optimization. A wide range of metaheuristic algorithms have emerged over the last two decades, and many metaheuristics such as particle swarm optimization are becoming increasingly popular. Despite their popularity, mathematical analysis of these algorithms lacks behind. Convergence analysis still remains unsolved for the majorit...

متن کامل

A Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics

One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...

متن کامل

Water cycle algorithm – A novel metaheuristic optimization method for solving constrained engineering optimization problems

0045-7949/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.compstruc.2012.07.010 ⇑ Corresponding author. Tel.: +60 379675266; fax: E-mail addresses: [email protected] (H. hoo.com (A. Sadollah), [email protected] (A m.edu.my (M. Hamdi). This paper presents a new optimization technique called water cycle algorithm (WCA) which is applied to a number of constrained op...

متن کامل

The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems

This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, alo...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2023

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2023.035911